The special tree number

The Special Tuberculosis Number

The Special Tuberculosis Number

The Special Tuberculosis Number

t The question of starting .g a large journal has often been mooted. prculosis is country and the problem of f^ation sufficiently important to justify an exa of that question. in collecting There would be some adva g Qne c0ver, together, from time to time, u ^ done authoritative articles and rep v^al subby specialists in this country on th? ^ ject, in order that they migh . q wouid able to all ...

Tree-chromatic number

Let us say a graph G has “tree-chromatic number” at most k if it admits a tree-decomposition (T, (Xt : t ∈ V (T ))) such that G[Xt] has chromatic number at most k for each t ∈ V (T ). This seems to be a new concept, and this paper is a collection of observations on the topic. In particular we show that there are graphs with tree-chromatic number two and with arbitrarily large chromatic number; ...

bounding the rainbow domination number of a tree in terms of its annihilation number

a {em 2-rainbow dominating function} (2rdf) of a graph $g$ is a function $f$ from the vertex set $v(g)$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin v(g)$ with $f(v)=emptyset$ the condition $bigcup_{uin n(v)}f(u)={1,2}$ is fulfilled, where $n(v)$ is the open neighborhood of $v$. the {em weight} of a 2rdf $f$ is the value $omega(f)=sum_{vin v}|f (v)|$. the {em $2$-r...